A Constant Approximation Algorithm for Maximum Weight Triangulation
نویسنده
چکیده
The paper is the first report on approximation algorithms for computing the maximum weight triangulation of a set of n points in the plane. We prove an Ω( √ n) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulation. We then propose the Spoke Triangulation algorithm, which always approximates the maximum weight triangulation for points in general position within a factor of six and can be computed in O(n log n) time. We also prove that Spoke Triangulation approximates the maximum weight triangulation of a convex polygon within a factor of two.
منابع مشابه
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in triangulation is maximized. We prove an ( √ n) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulatio...
متن کاملQuasi - Greedy Triangulations Approximating
This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? 2. Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum? The answer to the rst question is that the known (p n) lower bound is tight. The second quest...
متن کاملOn a linear program for minimum-weight triangulation
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomialtime heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first su...
متن کاملApproximating the Minimum Weight Steiner Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generali...
متن کاملMinimum Weight Pseudo-Triangulations
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...
متن کامل